Search results for "Weber problem"
showing 2 items of 2 documents
On Pareto optima, the Fermat-Weber problem, and polyhedral gauges
1990
This paper deals with multiobjective programming in which the objective functions are nonsymmetric distances (derived from different gauges) to the points of a fixed finite subset of ℝn. It emphasizes the case in which the gauges are polyhedral. In this framework the following result is known: if the gauges are polyhedral, then each Pareto optimum is the solution to a Fermat—Weber problem with strictly positive coefficients. We give a new proof of this result, and we show that it is useful in finding the whole set of efficient points of a location problem with polyhedral gauges. Also, we characterize polyhedral gauges in terms of a property of their subdifferential.
A primal-dual algorithm for the fermat-weber problem involving mixed gauges
1987
We give a new algorithm for solving the Fermat-Weber location problem involving mixed gauges. This algorithm, which is derived from the partial inverse method developed by J.E. Spingarn, simultaneously generates two sequences globally converging to a primal and a dual solution respectively. In addition, the updating formulae are very simple; a stopping rule can be defined though the method is not dual feasible and the entire set of optimal locations can be obtained from the dual solution by making use of optimality conditions. When polyhedral gauges are used, we show that the algorithm terminates in a finite number of steps, provided that the set of optimal locations has nonepty interior an…